On String Languages Generated by Numerical P Systems
نویسندگان
چکیده
Numerical P systems are a class of P systems inspired both from the structure of living cells and from economics. Usually, they are used as devices for computing sets of numbers. In this work, we consider numerical P systems as language generators: symbols are associated with numbers (portions of the “production value”) sent to the environment. The generative capacity of such systems is investigated, both for the standard and the enzymatic form of numerical P systems, having as a reference the families of languages in the Chomsky hierarchy. Key-words: bio-inspired computing, membrane computing, numerical P system, Chomsky hierarchy, universality.
منابع مشابه
Splicing Operation on Graphs
In this paper, we introduce the splicing operation on graph P system with the feature of conditional communication. We use the notions of Fruend graph splicing and generate the string graph languages. We study the generative power of the splicing graph P system with conditional communication with the other classes of string graph languages and give comparison results of the languages generated ...
متن کاملProbabilistic simple splicing systems
Articles you may be interested in Some characteristics of probabilistic one-sided splicing systems AIP Conf. Abstract. A splicing system, one of the early theoretical models for DNA computing was introduced by Head in 1987. Splicing systems are based on the splicing operation which, informally, cuts two strings of DNA molecules at the specific recognition sites and attaches the prefix of the fi...
متن کاملGeneral Multigenerative Grammar Systems
The formal language theory has intensively investigated various grammar systems (see [1], l2l, [8]), which consist of several cooperating components, usually represented by grammars. Although this variety is extremely broad, all these grammar systems always use a derivation that generates a single string. In this paper, however, we introduce grammar systems that simultaneously generate several ...
متن کاملOn Positioned Eco-grammar Systems and Pure Grammars of Type 0
In this paper we extend our results given in [5] where we compared PEG systems with pure regulated context-free grammars (see [3]). We will show that the family of languages generated by the pure grammars of type 0 is a proper subclass of the family of languages generated by positioned eco-grammar systems. We present a way how to coordinate parallel behavior of agents with one-sided context in ...
متن کاملBag Context Tree Grammars
Bag context is a device for regulated rewriting in tree and string grammars. It represents context that is not part of the developing tree or string, but evolves on its own during a derivation. Motivation for investigating bag context tree languages is provided by showing that the class of bag context tree languages is the closure of the class of random context tree languages under linear top-d...
متن کامل